A Hybrid Algorithm for Association Rule Hiding using Representative Rule

نویسندگان

  • Vikram Garg
  • Anju Singh
  • Divakar Singh
چکیده

In the recent years, data mining has emerged as a very popular tool for extracting hidden knowledge from collection of large amount of data. One of the major challenges of data mining is to find the hidden knowledge in the data while the sensitive information is not revealed. Many strategies have been proposed to hide the information containing sensitive data. Privacy preserving data mining is an answer to such challenge. Association rule hiding is one of the PPDM techniques to protect the sensitive association rule generated by Association rule mining (ARM). In this paper, the data distortion technique for hiding the sensitive information is used. The proposed approach uses the concept of Representative Rule (RR) which is used to prune the number of association rule. The proposed algorithm hides the more number of rules while making the fewer database scans.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data sanitization in association rule mining based on impact factor

Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...

متن کامل

Association Rule Hiding for Data Mining

The best ebooks about Association Rule Hiding For Data Mining that you can get for free here by download this Association Rule Hiding For Data Mining and save to your desktop. This ebooks is under topic such as association rule hiding for data mining springer association rule hiding for data mining advances in association rule hiding knowledge and data engineering an efficient association rule ...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

Introducing an algorithm for use to hide sensitive association rules through perturb technique

Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...

متن کامل

Hiding Sensitive Association Rule Using Clusters of Sensitive Association Rule

The security of the large database that contains certain crucial information, it will become a serious issue when sharing data to the network against unauthorized access. Association rules hiding algorithms get strong and efficient performance for protecting confidential and crucial data. The objective of the proposed Association rule hiding algorithm for privacy preserving data mining is to hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014